Semi-supervised Online Multiple Kernel Learning Algorithm for Big Data
نویسندگان
چکیده
منابع مشابه
Semi-supervised Online Multiple Kernel Learning Algorithm for Big Data
In order to improve the performance of machine learning in big data, online multiple kernel learning algorithms are proposed in this paper. First, a supervised online multiple kernel learning algorithm for big data (SOMK_bd) is proposed to reduce the computational workload during kernel modification. In SOMK_bd, the traditional kernel learning algorithm is improved and kernel integration is onl...
متن کاملA Scalable Kernel-Based Algorithm for Semi-Supervised Metric Learning
In recent years, metric learning in the semisupervised setting has aroused a lot of research interests. One type of semi-supervised metric learning utilizes supervisory information in the form of pairwise similarity or dissimilarity constraints. However, most methods proposed so far are either limited to linear metric learning or unable to scale up well with the data set size. In this paper, we...
متن کاملA multiple kernel framework for inductive semi-supervised SVM learning
We investigate the benefit of combining both cluster assumption and manifold assumption underlying most of the semi-supervised algorithms using the flexibility and the efficiency of multiple kernel learning. The multiple kernel version of Transductive SVM (a cluster assumption based approach) is proposed and it is solved based on DC (Difference of Convex functions) programming. Promising result...
متن کاملSemi-supervised deep kernel learning
Deep learning techniques have led to massive improvements in recent years, but large amounts of labeled data are typically required to learn these complex models. We present a semi-supervised approach for training deep models that combines the feature learning capabilities of neural networks with the probabilistic modeling of Gaussian processes and demonstrate that unlabeled data can significan...
متن کاملSpectral Kernel Learning for Semi-Supervised Classification
Typical graph-theoretic approaches for semisupervised classification infer labels of unlabeled instances with the help of graph Laplacians. Founded on the spectral decomposition of the graph Laplacian, this paper learns a kernel matrix via minimizing the leave-one-out classification error on the labeled instances. To this end, an efficient algorithm is presented based on linear programming, res...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA (Telecommunication Computing Electronics and Control)
سال: 2016
ISSN: 2302-9293,1693-6930
DOI: 10.12928/telkomnika.v14i2.2751